/// @tags:
#include <cstdio>
#include <functional>
#include <iostream>
#include <numeric>

using std::cin, std::cout, std::endl;

namespace BlueQuantum {

typedef long long ll;

constexpr int maxn = 1e3 + 2, maxk = 1e3 + 2, mod = 998244353;

ll qpow(ll base, int index) {
  ll res = 1;
  while (index) {
    if (index & 1) res = res * base % mod;
    base = base * base % mod;
    index >>= 1;
  }
  return res;
}

ll f[maxk][maxn][2];

int main() {
  int n, m, k;
  cin >> n >> m >> k;
  ll inv = qpow(m, mod - 2);
  f[0][0][0] = 1;  // 0 right 1 left
  for (int i = 1; i <= k; ++i) {
    for (int j = 0; j <= n; ++j) {
      if (j != 0) {
        for (int h = 1; h <= m; ++h) {
          int target = j - h;
          bool flag = false;
          if (target < 0) target = h - j, flag = true;
          if (target == n) continue;
          f[i][j][0] += inv * f[i - 1][target][flag] % mod;
          f[i][j][0] %= mod;
        }
      }
      // if ()
      if (n - j) {
        for (int h = m - (n - j); h >= 1; --h) {
          int target = n - h;
          // bool flag = true;
          // if (target > n) target = n - (j + h - n), flag = false;
          // if (target == n) continue;
          f[i][j][0] += inv * f[i - 1][target][0] % mod;
          f[i][j][0] %= mod;
        }
      }
    }
  }
  ll ans = 0;
  for (int i = 1; i <= k; ++i) {
    ans += f[i][n][0];
    ans %= mod;
  }
  cout << ans;
  return 0;
}

}  // namespace BlueQuantum

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("E - Sugoroku 4.in", "r", stdin);
  freopen("E - Sugoroku 4.out", "w", stdout);
#endif
#endif

  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  return BlueQuantum::main();
}
